Construction of Linear Codes Having Prescribed Primal-dual Minimum Distance with Applications in Cryptography
نویسنده
چکیده
A method is given for the construction of linear codes with prescribed minimum distance and also prescribed minimum distance of the dual code. This works for codes over arbitrary finite fields. In the case of binary codes Matsumoto et al. showed how such codes can be used to construct cryptographic Boolean functions. This new method allows to compute new bounds on the size of such codes, extending the table of Matsumoto et al.. coding theory, minimum distance, dual minimum distance, Boolean function
منابع مشابه
Classification and nonexistence results for linear codes with prescribed minimum distances
Starting from a linear [n, k, d]q code with dual distance d ⊥, we may construct an [n−d⊥, k−d⊥+1,≥ d]q code with dual distance at least l d⊥ q m using construction Y1. The inverse construction gives a rule for the classification of all [n, k, d]q codes with dual distance d ⊥ by adding d⊥ further columns to the parity check matrices of the smaller codes. Isomorph rejection is applied to guarante...
متن کاملSome Applications of Coding Theory in Cryptography
The applicability of techniques in coding theory to problems in cryptography is illustrated by examples concerning secret-sharing schemes with tailored access priveleges, the design of perfect local randomizers, the construction of t-resilient functions, and the quantization of the nonlinearity of boolean functions. Some novel coding concepts, in particular the notions of minimal codewords in l...
متن کاملNew constructions of MDS codes with complementary duals
Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This application of LCD codes renewed the interest in the construction of LCD codes having a large minimum distance. MDS codes are optimal in the sense that the m...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملConstruction of linear codes with prescribed minimum distance
We construct linear codes over finite fields with prescribed minimum distance by selectiong columns of the generator matrix. This selection problem can be formulated as an integer programming problem. In order to reduce the search space we prescribe a group of automorphisms. Then, in many cases the resulting integer programming problem can be solved by lattice point enumeration. With this appro...
متن کامل